An external-memory depth-first search algorithm for general grid graphs

On External-Memory Planar Depth First Search

Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no spaceand I/O-efficient algorithms are known for depth-first search or breath-first search in sparse graphs. In this paper, we present two new results on I/O-efficient depth-first search in an important class of sparse graphs, namely undirected emb...

An Implementation of External-Memory Depth-First Search

In many different areas of computing, problems can arise which are too large to fit in main memory. For these problems, the I/O cost of moving data between main memory and secondary storage (for example, disks) becomes a significant bottleneck affecting the performance of the program. Since most algorithms do not take into account the size of main memory, new algorithms have been developed to o...

An Efficient Distributed Depth-First-Search Algorithm

Consider a communication network. Our goal is to equip the set of processors in the network with a control algorithm that will allow a processor in the network to effect a depth-first traversal through the graph underlying the network, using messages. The output of the algorithm is a depthfirst-search (DFS) tree of the graph underlying the network, kept in a distributed fashion, i.e., at the en...

Depth First Search in Graphs

Keyword search on external memory data graphs

Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural “lowest common denominator” representation which can combine relational, XML and HTML data. Responses to keyword queries are usually modeled as trees that connect nodes matching the keywords. In this paper we address the problem of keyword search on graphs that may be significantly lar...